Implantation de grammaires de propriétés en CHR

Non-linear recursive grammar for Sign languages (Grammaire récursive non linéaire pour les langues des signes) [in French]

Résumé. Cet article propose une approche pour la formalisation de grammaires pour les langues des signes, rendant compte de leurs particularités linguistiques. Comparable aux grammaires génératives en termes de récursivité productive, le système présente des propriétés nouvelles comme la multi-linéarité permettant la spécification simultanée des articulateurs. Basé sur l’analyse des liens entre...

Towards universality of growth grammars: Models of Bell, Pagès, and Takenaka revisited

“Growth grammars” are extended parametric Lindenmayer systems, enriched by some novel features (expand operator, global sensitivity, interpretive rules, arithmetical-structural operators). They can serve as a formal basis for describing functionalstructural plant models from the literature. This is demonstrated on three well-known models having in common that they were originally developed with...

Computing of Graphs of Relations Using Generative Grammars

— By considering représentations of graphs of relations on the set of natural numbers by bounded languages it is possible to develop a study of relations which are computable in a certain sensé by context-sensitive grammars. There are obtained closure proprieties for the class of these relations, which allow to prove the context-sensitiveness of certain languages. Résumé. — En représentant les ...

Recherches pour la détermination du degré des propriétés antigéniques de quelques souches vaccinales du virus de la maladie de Newcastle administrées par voie oculaire à des poulets

Des grammaires de graphes contextuelles qui charactérisent les langages contextuels

Deterministic graph grammars generate a family of infinite graphs which characterize context-free (word) languages. In this paper we presents a context-sensitive extension of these grammars. We achieve a characterization of context-sensitive (word) languages. We show that this characterization is not straightforward and that unless having some rigorous restrictions, contextual graph grammars ge...